Multi-Step Multi-Sensor Hider-Seeker Games
نویسندگان
چکیده
We study a multi-step hider-seeker game where the hider is moving on a graph and, in each step, the seeker is able to search c subsets of the graph nodes. We model this game as a zero-sum Bayesian game, which can be solved in weakly polynomial time in the players’ action spaces. The seeker’s action space is exponential in c, and both players’ action spaces are exponential in the game horizon. To manage this intractability, we use a column/constraint generation approach for both players. This approach requires an oracle to determine best responses for each player. However, we show that computing a best response for the seeker is NPhard, even for a single-step game when c is part of the input, and that computing a best response is NPhard for both players for the multi-step game, even if c = 1. An integer programming formulation of the best response for the hider is practical for moderate horizons, but computing an exact seeker best response is impractical due to the exponential dependence on both c and the horizon. We therefore develop an approximate best response oracle with bounded suboptimality for the seeker. We prove performance bounds on the strategy that results when column/constraint generation with approximate best responses converges, and we measure the performance of our algorithm in simulations. In our experimental results, column/constraint generation converges to near-minimax strategies for both players fairly quickly.
منابع مشابه
Monte-Carlo Tree Search for the Game of Scotland Yard1
This abstract describes how Monte-Carlo Tree Search (MCTS) [1, 4] can be applied to play the hideand-seek game Scotland Yard. This game is played by 6 players: 5 seekers and 1 hider. The seekers work together to capture the hider by moving one of their pawns to the location occupied by the hider. The game is played on a map consisting of 199 locations, connected by 4 different transportation ty...
متن کاملAirborne Seeker Application in Three Dimensional Formation Flight of UAVs
This paper deals with the leader-follower formation control problem while communication constraint in data transmitting is considered. From a practical point of view, we study the case in which unmanned vehicles are subject to the limited sensing, and communication is of a particular interest. A three-dimensional formation flight of multi-unmanned aerial vehicles with leader-follower configurat...
متن کاملOn BMD Target Tracking: Data Association and Data Fusion
In this paper we consider multitarget tracking with multiple sensors for BMD. In a previous paper multitarget tracking with a single sensor was considered [8]. A ballistic missile may be in several pieces, presenting multiple targets. Besides the ground based or ship sensor there is also the missile seeker. We consider algorithms for generating and maintaining the tracks needed for BMD. A cue o...
متن کاملMorse Theory and Evasiveness
x0. Introduction. Consider a game played by 2 players, whom we call the hider and the seeker. Let S be a simplex of dimension n, with vertices x 0 , x 1 ; : : :; x n , and M a subcomplex of S, known to both the hider and the seeker. Let be a simplex of S, known only to the hider. The seeker is permitted to ask questions of the sort \Is vertex x i in ?" The seeker's goal is to determine whether ...
متن کاملMulti-layer Clustering Topology Design in Densely Deployed Wireless Sensor Network using Evolutionary Algorithms
Due to the resource constraint and dynamic parameters, reducing energy consumption became the most important issues of wireless sensor networks topology design. All proposed hierarchy methods cluster a WSN in different cluster layers in one step of evolutionary algorithm usage with complicated parameters which may lead to reducing efficiency and performance. In fact, in WSNs topology, increasin...
متن کامل